In the Priority $k$-Center problem, the input consists of a metric space $(X,d)$, an integer $k$, and for each point $v \in X$ a priority radius $r(v)$. The goal is to choose $k$-centers $S \subseteq X$ to minimize $\max_{v \in X} \frac{1}{r(v)} d(v,S)$. If all $r(v)$'s are uniform, one obtains the $k$-Center problem. Plesn\'ik [Plesn\'ik, Disc. Appl. Math. 1987] introduced the Priority $k$-Center problem and gave a $2$-approximation algorithm matching the best possible algorithm for $k$-Center. We show how the problem is related to two different notions of fair clustering [Harris et al., NeurIPS 2018; Jung et al., FORC 2020]. Motivated by these developments we revisit the problem and, in our main technical contribution, develop a framework that yields constant factor approximation algorithms for Priority $k$-Center with outliers. Our framework extends to generalizations of Priority $k$-Center to matroid and knapsack constraints, and as a corollary, also yields algorithms with fairness guarantees in the lottery model of Harris et al [Harris et al, JMLR 2019].

In multi-agent systems with large number of agents, typically the contribution of each agent to the value of other agents is minimal (e.g., aggregation systems such as Uber, Deliveroo). In this paper, we consider such multi-agent systems where each agent is self-interested and takes a sequence of decisions and represent them as a Stochastic Non-atomic Congestion Game (SNCG). We derive key properties for equilibrium solutions in SNCG model with non-atomic and also nearly non-atomic agents. With those key equilibrium properties, we provide a novel Multi-Agent Reinforcement Learning (MARL) mechanism that minimizes variance across values of agents in the same state. To demonstrate the utility of this new mechanism, we provide detailed results on a real-world taxi dataset and also a generic simulator for aggregation systems. We show that our approach reduces the variance in revenues earned by taxi drivers, while still providing higher joint revenues than leading approaches.

In this paper, we propose and showcase, for the first time, monocular multi-view layout estimation for warehouse racks and shelves. Unlike typical layout estimation methods, MVRackLay estimates multi-layered layouts, wherein each layer corresponds to the layout of a shelf within a rack. Given a sequence of images of a warehouse scene, a dual-headed Convolutional-LSTM architecture outputs segmented racks, the front and the top view layout of each shelf within a rack. With minimal effort, such an output is transformed into a 3D rendering of all racks, shelves and objects on the shelves, giving an accurate 3D depiction of the entire warehouse scene in terms of racks, shelves and the number of objects on each shelf. MVRackLay generalizes to a diverse set of warehouse scenes with varying number of objects on each shelf, number of shelves and in the presence of other such racks in the background. Further, MVRackLay shows superior performance vis-a-vis its single view counterpart, RackLay, in layout accuracy, quantized in terms of the mean IoU and mAP metrics. We also showcase a multi-view stitching of the 3D layouts resulting in a representation of the warehouse scene with respect to a global reference frame akin to a rendering of the scene from a SLAM pipeline. To the best of our knowledge, this is the first such work to portray a 3D rendering of a warehouse scene in terms of its semantic components - Racks, Shelves and Objects - all from a single monocular camera.

集成开发环境（IDE）提供工具支持，以自动化许多源代码编辑任务。传统上，IDE仅使用空间上下文，即开发人员正在编辑的位置来生成候选编辑建议。但是，仅空间上下文通常不足以自信地预测开发人员的下一个编辑，因此IDE在某个位置会产生许多建议。因此，IDE通常不会主动提供建议，而是需要单击特定图标或菜单，然后从大量潜在建议列表中进行选择。结果，开发人员通常会错过使用工具支持的机会，因为他们不知道它存在或忘记使用它。为了更好地理解开发人员行为中的常见模式并产生更好的编辑建议，我们还可以使用时间上下文，即开发人员最近执行的编辑。为了启用基于时间上下文的编辑建议，我们提出了《守望先锋》，这是一种从IDE中执行的开发人员编辑痕迹学习编辑序列模式的新颖技术。我们的实验表明，《守望先锋》具有78％的精度，守望先锋不仅完成了开发人员错过使用IDE工具支持的机会，而且还预测了在IDE中没有工具支持的新编辑。

为了分析多维数据的丰富，已经开发了张量的框架。传统上，矩阵奇异值分解（SVD）用于从包含矢量化数据的矩阵中提取最主导的特征。虽然SVD对可以适当表示为矩阵的数据非常有用，但是矢量化步骤导致我们丢失了数据内在的高维关系。为了便于高效的多维特征提取，我们利用了使用基于投影的分类算法，使用T-SVDM，矩阵SVD的张量模拟。我们的作品扩展了T-SVDM框架和分类算法，最初提出了所有数量的尺寸。然后，我们使用Starplus FMRI DataSet将此算法应用于分类任务。我们的数值实验表明，基于张于FMRI分类的卓越方法，而不是基于最佳的等效矩阵的方法。我们的结果说明了我们选择的张量框架的优势，提供了对参数的有益选择的洞察力，并且可以进一步开发用于分类更复杂的成像数据。我们在https://github.com/elizabethnewman/tensor-fmri提供我们的Python实现。

现代软件系统和产品越来越依赖机器学习模型，以基于与用户和系统的交互进行数据驱动的决策，例如计算基础架构。对于更广泛的采用，这种做法必须（i）容纳没有ML背景的软件工程师，并提供（ii）提供优化产品目标的机制。在这项工作中，我们描述了一般原则和特定的端到端毫升平台，为决策和反馈集合提供易于使用的API。循环仪支持从在线数据收集到模拟培训，部署，推理的完整端到端ML生命周期，并扩展支持和调整产品目标的评估和调整。我们概述了平台架构和生产部署的整体影响 - 循环仪当前托管700毫升型号，每秒达到600万决定。我们还描述了学习曲线并总结了平台采用者的经验。